WATERMARKING USING DECIMAL SEQUENCES
نویسندگان
چکیده
منابع مشابه
Watermarking Using Decimal Sequences
This paper introduces the use of decimal sequences in a code division multiple access (CDMA) based watermarking system to hide information for authentication in black and white images. Matlab version 6.5 was used to implement the algorithms discussed in this paper. The advantage of using d-sequences over PN sequences is that one can choose from a variety of prime numbers which provides a more f...
متن کاملImproved Watermarking Scheme Using Decimal Sequences
This thesis improves upon the work carried out by Mandhani on decimal sequence watermarking showing that the embedding and decoding algorithms used by Mandhani are not robust. We next specify improvements to these algorithms so that the peak signal to noise ratio (PSNR) is maximized and the distortion introduced in the image due to the embedding is minimized. By exploiting the cross correlation...
متن کاملImproved Watermarking Scheme Using Decimal Sequences
If the signal y has been marked and no malicious attacks or other signal modifications are performed, then E [y ⋅ w] = δ, else E [y ⋅ w] = 0. The threshold for detection is τ. The watermark is present if C (y, w) > τ. Under the conditions that x and w are i.i.d. signals, such a detection scheme is optimal. It is believed that spread spectrum (SS) method of watermarking can incorporate a high de...
متن کاملIntroduction to Decimal Sequences
A decimal sequence is obtained when a number is represented in a decimal form in a base r and it may terminate, repeat or be aperiodic. For a certain class of decimal sequences of q 1 , prime, the digits spaced half a period apart add up to q 1 − r , where r is the base in which the sequence is expressed. Decimal sequences are known to have good crossand auto-correlation properties and they can...
متن کاملBinary Random Sequences Obtained From Decimal Sequences
D sequences [1-15] are perhaps the simplest family of random sequences that subsumes other families such as shift register sequences [16]. In their ordinary form, d sequences are not computationally complex [2], but they can be used in a recursive form [8] that is much stronger from a complexity point of view. The basic method of the generating the binary d-sequences is given in [1]. The autoco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cryptologia
سال: 2005
ISSN: 0161-1194,1558-1586
DOI: 10.1080/0161-110591893762